Search results for "geneettiset algoritmit"
showing 10 items of 10 documents
On optimal deployment of low power nodes for high frequency next generation wireless systems
2018
Recent development of wireless communication systems and standards is characterized by constant increase of allocated spectrum resources. Since lower frequency ranges cannot provide sufficient amount of bandwidth, new bands are allocated at higher frequencies, for which operators resort to deploy more base stations to ensure the same coverage and to utilize more efficiently higher frequencies spectrum. Striving for deployment flexibility, mobile operators can consider deploying low power nodes that could be either small cells connected via the wired backhaul or relays that utilize the same spectrum and the wireless access technology. However, even though low power nodes provide a greater fl…
Evolutionary design optimization with Nash games and hybridized mesh/meshless methods in computational fluid dynamics
2012
Assessment of Classifiers and Remote Sensing Features of Hyperspectral Imagery and Stereo-Photogrammetric Point Clouds for Recognition of Tree Specie…
2018
Recognition of tree species and geospatial information on tree species composition is essential for forest management. In this study, tree species recognition was examined using hyperspectral imagery from visible to near-infrared (VNIR) and short-wave infrared (SWIR) camera sensors in combination with a 3D photogrammetric canopy surface model based on RGB camera stereo-imagery. An arboretum with a diverse selection of 26 tree species from 14 genera was used as a test area. Aerial hyperspectral imagery and high spatial resolution photogrammetric color imagery were acquired from the test area using unmanned aerial vehicle (UAV) borne sensors. Hyperspectral imagery was processed to calibrated …
Simultaneous Noise and Impedance Fitting to Transition-Edge Sensor Data Using Differential Evolution
2020
We discuss a robust method to simultaneously fit a complex multi-body model both to the complex impedance and the noise data for transition-edge sensors. It is based on a differential evolution (DE) algorithm, providing accurate and repeatable results with only a small increase in computational cost compared to the Levenberg–Marquardt (LM) algorithm. Test fits are made using both DE and LM methods, and the results compared with previously determined best fits, with varying initial value deviations and limit ranges for the parameters. The robustness of DE is demonstrated with successful fits even when parameter limits up to a factor of 10 from the known values were used. It is shown that the…
Memory-saving optimization algorithms for systems with limited hardware
2011
On data mining applications in mobile networking and network security
2014
Taming big knowledge evolution
2016
Information and its derived knowledge are not static. Instead, information is changing over time and our understanding of it evolves with our ability and willingness to consume the information. When compared to humans, current computer systems seem very limited in their ability to really understand the meaning of things. On the other hand, they are very powerful when it comes down to performing exact computations. One aspect which sets humans apart from machines when trying to understand the world is that we will often make mistakes, forget information, or choose what to focus on. To put this in another perspective, it seems like humans can behave somehow more randomly and still outperform …
Algorithmic issues in computational intelligence optimization: from design to implementation, from implementation to design
2016
The vertiginous technological growth of the last decades has generated a variety of powerful and complex systems. By embedding within modern hardware devices sophisticated software, they allow the solution of complicated tasks. As side effect, the availability of these heterogeneous technologies results into new difficult optimization problems to be faced by researchers in the field. In order to overcome the most common algorithmic issues, occurring in such a variety of possible scenarios, this research has gone through cherry-picked case-studies. A first research study moved from implementation to design considerations. Implementation limitations, such as memory constraints and real-time r…
Simple memetic computing structures for global optimization
2014
Diverse partner selection with brood recombination in genetic programming
2018
The ultimate goal of learning algorithms is to find the best solution from a search space without testing each and every solution available in the search space. During the evolution process new solutions (children) are produced from existing solutions (parents), where new solutions are expected to be better than existing solutions. This paper presents a new parent selection method for the crossover operation in genetic programming. The idea is to promote crossover between two behaviourally (phenotype) diverse parents such that the probability of children being better than their parents increases. The relative phenotype strengths and weaknesses of pairs of parents are exploited to find out i…